Tree Inclusion Checking Revisited
نویسندگان
چکیده
In this paper, we discuss an efficient algorithm for the ordered tree inclusion problem, by which it is checked whether a pattern tree (forest) P can be embedded in a target tree (forest) T. The time complexity of this algorithm is bounded by O(|T|logDP), where DP is the depth of P; and its space overhead is bounded by O(|T| + |P|). This computational complexity is better than any existing algorithm for this problem.
منابع مشابه
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
The paper considers several issues related to efficient use of tree automata in formal verification. First, a new efficient algorithm for inclusion checking on non-deterministic tree automata is proposed. The algorithm traverses the automaton downward, utilising antichains and simulations to optimise its run. Results of a set of experiments are provided, showing that such an approach often very...
متن کاملAntichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata. We have implemented these algorithms in a prototype tool and we present experiments which show that the algorithms provide a significant improvement over the traditional determinisationbased approaches. Furthermore, we use the proposed antichain-based inclusion checking algorithm...
متن کاملSimulations and Antichains for Efficient Handling of Finite Automata
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well...
متن کاملExplorer Reduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملEfficient Inclusion Checking for Deterministic Tree Automata and DTDs
We present a new algorithm for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| ∗ |B|) where B is deterministic. We extend this algorithm for testing inclusion between automata for unranked trees A and deterministic DTDsD in time O(|A|∗ |Σ| ∗ |D|). No previous algorithms with these complexities exist.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015